Compacting garbage collection with ambiguous roots
نویسندگان
چکیده
منابع مشابه
Real-Time Compacting Garbage Collection
1. Introduction Traditional batch garbage collection techniques lead to long delays in the programming execution. Different methods to reduce the delays have been suggested. These methods can be divided into two classes: those intended to give acceptable pauses in interactive programs (programs that interact with a user), and those intended for real-time programs. In an interactive program, it ...
متن کاملNon-compacting Memory Allocation and Real-time Garbage Collection Dissertation Proposal
Garbage collection is the automatic reclamation of computer storage Knu73, Coh81, Wil92, Wil95]. While in many systems, programmers must explicitly reclaim heap memory at some point in their program by using a \free" or \dispose" statement, garbage collected systems free the programmer from this burden. In spite of its obvious attractiveness for many applications, garbage collection for real-ti...
متن کاملA Compacting Garbage Collector for Unidirectional Heaps
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged so that it is unidirectional. We here present a compacting garbage collection algorithm which utilizes the fact that a heap is unidirectional. Only one memory space is used in our algorithm. In fact, no extra memory ...
متن کاملA Compacting Garbage Collector for Erlang
By utilising the fact that all data in the heap in an Erlang implementation may be arranged so that all pointers go towards earlier allocated objects, a compacting garbage collection algorithm has been designed. In contrast to a copying garbage collection algorithm, only one memory space is used. In fact, no extra memory is used at all, not even any reserved bits within the cells. The algorithm...
متن کاملA Generational, Compacting Garbage Collector for C++
One of the most striking differences between any Lisp dialect and C++ is not the obvious syntax differences, but rather their opposing views on management of objects with indefinite extent. While Lisp systems automatically recover storage used by objects that are no longer needed by the program, C++ requires that the user explicitly delete the object in order to reclaim storage. Automatically m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Lisp Pointers
سال: 1988
ISSN: 1045-3563
DOI: 10.1145/1317224.1317225